Minimal Work Required for Arbitrary Computation
نویسندگان
چکیده
SFI Working Papers contain accounts of scienti5ic work of the author(s) and do not necessarily represent the views of the Santa Fe Institute. We accept papers intended for publication in peer-‐reviewed journals or proceedings volumes, but not papers that have already appeared in print. Except for papers by our external faculty, papers must be based on work done at SFI, inspired by an invited visit to or collaboration at SFI, or funded by an SFI grant.
منابع مشابه
On the Message Complexity of Secure Multiparty Computation
We study the minimal number of point-to-point messages required for general secure multiparty computation (MPC) in the setting of computational security against semi-honest, static adversaries who may corrupt an arbitrary number of parties. We show that for functionalities that take inputs from n parties and deliver outputs to k parties, 2n+k−3 messages are necessary and sufficient. The negativ...
متن کاملA Theoretical Study on the Rank of the Integral Operators for Large-Ââ•’Scale Electrodynamic Analysis
We theoretically prove that the minimal rank of the interaction between two separated geometry blocks in an integral-equation based analysis of general threedimensional objects, for a prescribed error bound, scales linearly with the electric size of the block diameter. We thus prove the existence of the error-bounded lowrank representation of both surface and volume based integral operators for...
متن کاملGenerating Efficient MCMC Kernels from Probabilistic Programs
Universal probabilistic programming languages (such as Church [6]) trade performance for abstraction: any model can be represented compactly as an arbitrary stochastic computation, but costly online analyses are required for inference. We present a technique that recovers hand-coded levels of performance from a universal probabilistic language, for the Metropolis-Hastings (MH) MCMC inference al...
متن کاملIdeal of Lattice homomorphisms corresponding to the products of two arbitrary lattices and the lattice [2]
Abstract. Let L and M be two finite lattices. The ideal J(L,M) is a monomial ideal in a specific polynomial ring and whose minimal monomial generators correspond to lattice homomorphisms ϕ: L→M. This ideal is called the ideal of lattice homomorphism. In this paper, we study J(L,M) in the case that L is the product of two lattices L_1 and L_2 and M is the chain [2]. We first characterize the set...
متن کاملThe minimal work cost of information processing
Irreversible information processing cannot be carried out without some inevitable thermodynamical work cost. This fundamental restriction, known as Landauer's principle, is increasingly relevant today, as the energy dissipation of computing devices impedes the development of their performance. Here we determine the minimal work required to carry out any logical process, for instance a computati...
متن کامل